IAENG International Journal of Computer Science, 36:2, IJCS_36_2_03 ______________________________________________________________________________________ An Improved BA Model for Router-level Internet Macroscopic Topolo

Source URL: www.iaeng.org

• Social networks
• Network topology
• Network theory
• Scale-free network
• Barabási–Albert model
• Degree distribution
• Computer network
• Topology
• Power law
• Graph theory
• Mathematics
• Random graphs

Random Graphs and Their Applications Les graphes al´ eatoires et leurs applications (Org: Anthony Bonato (Wilfrid Laurier), Penny Haxell (Waterloo) and/et Nicholas Wormald (Waterloo)) TOM BOHMAN, Carnegie Mellon Univer

Source URL: cms.math.ca

• Graph coloring
• NP-complete problems
• Random graph
• Graph
• Connectivity
• Cubic graph
• Dense graph
• Matroid theory
• Randomized algorithm
• Graph theory
• Mathematics
• Theoretical computer science

Hindawi Publishing Corporation The Scientific World Journal Volume 2013, Article ID[removed], 5 pages http://dx.doi.org[removed][removed]Research Article

Source URL: downloads.hindawi.com

• Critical phenomena
• Random graphs
• Lattice models
• Percolation threshold
• Bipartite graph
• Spherical harmonics
• Graph
• Directed percolation
• Percolation theory
• Graph theory
• Mathematics
• Mathematical analysis

JEANNETTE JANSSEN, Dalhousie University, Halifax, Nova Scotia Infinite limits of random graph models for self-organizing networks Self-organizing networks are real or virtual networks that are formed by the actions of a

Source URL: cms.math.ca

• Networks
• Random graphs
• Graph
• Social network
• Erdős–Rényi model
• Exponential random graph models
• Graph theory
• Mathematics
• Network theory

JOEL SPENCER, Courant Institute, New York Counting Connected Graphs using Erd˝ os Magic Let C(k, l) be the number of labelled connected graphs with k vertices, k − 1 + l edges. We employ random graphs and breadth firs

Source URL: cms.math.ca

ROBERT ROBINSON, University of Georgia, Athens, GA Finding Hamilton Cycles in Random Cubic Graphs We consider the problem of finding a Hamilton cycle in a graph G drawn at random from the set of labeled cubic graphs of o

Source URL: cms.math.ca

econstor www.econstor.eu Der Open-Access-Publikationsserver der ZBW – Leibniz-Informationszentrum Wirtschaft The Open Access Publication Server of the ZBW – Leibniz Information Centre for Economics

Source URL: www.econstor.eu

• Physics
• Marketing
• Lattice models
• Discrete mathematics
• Random graphs
• Diffusion
• Percolation
• Monopoly
• Combinatorics
• Critical phenomena
• Mathematics

Measurement-calibrated Graph Models for Social Network Experiments Alessandra Sala, Lili Cao, Christo Wilson, Robert Zablit, Haitao Zheng and Ben Y. Zhao Computer Science, U. C. Santa Barbara, Santa Barbara, CA 93106, US

Source URL: www.cs.ucsb.edu

• Random graphs
• Social networks
• Watts and Strogatz model
• Network theory
• Degree distribution
• Barabási–Albert model
• Graph
• Topology
• Community structure
• Graph theory
• Mathematics
• Networks

Models of random regular graphs N. C. Wormald Summary This is a survey of results on properties of random regular graphs, together with an exposition of some of the main methods of obtaining these results. Related result

Source URL: www.math.uwaterloo.ca

• Pseudoforest
• Graph
• Adjacency matrix
• Cubic graph
• Erdős–Rényi model
• Watts and Strogatz model
• Graph theory
• Random graphs
• Random regular graph

Discrete Mathematics and Theoretical Computer Science (subm.), by the authors, 26–rev Quadratic exact-size and linear approximate-size random generation of planar graphs ´ Fusy1

Source URL: www.lix.polytechnique.fr

• Graph operations
• Graph coloring
• Apollonian network
• Planar separator theorem
• Graph theory
• Planar graphs
• Graph